Class $D$ supermartingales
نویسندگان
چکیده
منابع مشابه
Finitely Additive Supermartingales
The concept of finitely additive supermartingales, originally due to Bochner, is revived and developed. We exploit it to study measure decompositions over filtered probability spaces and the properties of the associated Doléans-Dade measure. We obtain versions of the Doob Meyer decomposition and, as an application, we establish a version of the Bichteler and Dellacherie theorem with no exogenou...
متن کاملAutomatic supermartingales acting on sequences
This paper describes a construction of supermartingales realized as automatic functions. A capital of supermartingales is represented using automatic capital groups (ACG). Properties of these automatic supermartingales are then studied. Automatic supermartingales induce a notion of random infinite binary sequence. We show that the class of random sequences coincide with that of disjunctive sequ...
متن کاملA maximal inequality for supermartingales∗
A tight upper bound is given on the distribution of the maximum of a supermartingale. Specifically, it is shown that if Y is a semimartingale with initial value zero and quadratic variation process [Y, Y ] such that Y + [Y, Y ] is a supermartingale, then the probability the maximum of Y is greater than or equal to a positive constant a is less than or equal to 1/(1 + a). The proof makes use of ...
متن کاملAttribute A Attribute BAttribute C Attribute D Attribute C Attribute D Class - Class - Class - Class - Class
In this paper, we examine Decision Graphs, a generalization of decision trees. We present an inference scheme to construct decision graphs using the Minimum Message Length Principle. Empirical tests demonstrate that this scheme compares favourably with other decision tree inference schemes. This work provides a metric for comparing the relative merit of the decision tree and decision graph form...
متن کاملAlgorithmic randomness and splitting of supermartingales
for all strings x. Any supermartingale corresponds to a strategy in the following game. In the beginning we have some initial capital (m(Λ), where Λ is the empty string). Before each round, we put part of the money on zero, some other part on one, and throw away the rest. Then the next random bit of the sequence is generated, the correct stake is doubled and the incorrect one is lost. In these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1963
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1963-10857-5